Chromatic numbers and indices of the optimised degree six 3-modified chordal ring network topology (IR)

Chien Stephen Lim Ern, - Raja Noor Farah Azura, Othman Mohamed,

QR Code Link :
Type :	article
Subject :	QA Mathematics
ISSN :	2289-5981
Main Author :	Chien Stephen Lim Ern, - Raja Noor Farah Azura, Othman Mohamed,
Title :	Chromatic numbers and indices of the optimised degree six 3-modified chordal ring network topology (IR)

Year of Publication :	2017
PDF Full Text :	The author has requested the full text of this item to be restricted.

Full Text :

Graph colouring is the labelling of the elements of a graph subject to certain constraints. It is divided into vertex and edge colouring. In both cases, the assignment of labels, traditionally called colours is such that two vertices or edges must not have the same colour. Graph colouring has various applications, especially in parallel computing. This paper introduces the degree six 3-modified chordal ring,

References

[1] Rosen, K. H. (2012). Discrete Mathematics and its Applications. (7th Edition). New York: McGraw-Hill. [2] Van Steen, M. (2010). Graph Theory and Complex Networks: An Introduction. (1st Edition). Amsterdam: Maarten van Steen. [3] R. N. F. Azura, M. Othman, Y. H. Peng, and M. H. Selamat. Malaysian Journal of Mathematical Sciences 4(2) (2010) 147-157. [4] R. N. Farah, M. Othman, M. H. Selamat. Journal of Computer Science,6(3) (2010) 279-284 [5] S. Bujnowski, B. Dubalski, A. Zabludowski, D. Ledziński, T. Marciniak, and J.M. Pedersen. Image Processing and Communications Challenges 2, Advances in Intelligent Systems and Computing, 84 (2010) 435-445. [6] B. W. Arden and H. Lee. IEEE Trans. Computer, C-30(4) (1981) 291-295. [7] D. Ledziński, S. Bujnowski, T. Marciniak, J.M. Pedersen, J.G. Lopez.Image Processing and Communications Challenges 5, Advances in Intelligent Systems and Computing 233 (2014) 281-299. [8] Brooks, R.L. On colouring the nodes of a network. Proceedings of the Cambridge Philosophical Society, Mathematical and Physical Sciences. 1941, 37(2):194–197, Available from, DOI: 10.1017/S030500410002168X. [9] D. Marx. Periodica Polytechnica, Electrical Engineering 48(1) (2004) 11-16. [10] P. Gupta. International Journal Of Core Engineering & Management (IJCEM). 1(2) (2014) 27-32. [11] Jungnickel, D. (2013). Graphs, Networks and Algorithms. (4th Edition). Springer. [12] Chetwynd A. G., Hilton A. J. W. Regular Graphs of High Degree are 1- Factorizable. Proceedings of the London Mathematical Society. 1985. 2: 193-206. Available from, DOI: 10.1112/plms/s3-50.2.193 [13] R. Green. (2015). Vizing’s Theorem And Edge-Chromatic Graph Theory. 1-8. Obtained from http://math.uchicago.edu/~may/REU2015/REUPapers/Green.pdf

This material may be protected under Copyright Act which governs the making of photocopies or reproductions of copyrighted materials.
You may use the digitized material for private study, scholarship, or research.

Back to previous page